Laurier Flow
⌘K

© 2026 LaurierFlow. All rights reserved.

AboutPrivacy



Schedule

Contributed by Students

Course Outlines

to view and upload course outlines

MA 338

Graph Theory

Selected topics may include graph colouring, extremal graph theory, planar graphs, random graphs, network flows, algebraic methods in graph theory, Ramsay theory for graphs, matching theory, graph algorithms; application of graph theory, such as applications to scheduling, VLSI circuits, compiler design, computer vision and the design of internet search engines. Prerequisites: MA238.

0%Liked
0%Easy
0%Useful
Based on 0 ratings

Reviews

No Reviews With Body Yet

Prerequisites

MA 238 (Min. Grade D-)

Leads To

No Leads To Information Available

Restrictions

Must be enrolled in one of the following Levels:Undergraduate (UG)